Practical State Recovery Attack on ICEPOLE
نویسندگان
چکیده
ICEPOLE is a CAESAR candidate which is claimed to have intermediate level of robustness under nonce reuse circumstances. In this report, we apply the differential-linear cryptanalysis to the ICEPOLE family and show that ICEPOLE is insecure when the nonce is reused. Under the nonce-misuse circumstances, there is differential-linear distinguishing attack on ICEPOLE with time and data complexity less than 2. Based on the differential-linear properties, we propose the state recovery attacks on all the three variants of the ICEPOLE family. The results show that it is possible to recover the 256 bits unknown state of ICEPOLE–128 and ICEPOLE–128a with practical complexity 2. And for ICEPOLE–256a, the complexity is 2. We experimentally verified the state recovery attack on ICEPOLE–128 and ICEPOLE–128a, and the unknown state can be recovered in a few days using a 64 cores server. 1 The ICEPOLE Authenticated Cipher The ICEPOLE family of authenticated ciphers includes three variants according to the parameters: ICEPOLE–128, ICEPOLE–128a and ICEPOLE–256a. The one with 128-bit secret message number, 128-bit key and 128-bit nonce is named ICEPOLE–128. And the other two variants do not have secret message number and are named ICEPOLE–128a and ICEPOLE–256a according to the key length. The length of nonce for these two variants is 96-bit. We will briefly describe the ICEPOLE authenticated cipher. The full specification can be found in [7]. And an overview of ICEPOLE–128 is provided in Figure 1.
منابع مشابه
Differential-Linear Cryptanalysis of ICEPOLE
ICEPOLE is a CAESAR candidate with the intermediate level of robustness under nonce misuse circumstances in the original document. In particular, it was claimed that key recovery attack against ICEPOLE is impossible in the case of nonce misuse. ICEPOLE is strong against the differential cryptanalysis and linear cryptanalysis. In this paper, we developed the differential-linear attacks against I...
متن کاملForgery Attacks on Round-Reduced ICEPOLE-128
ICEPOLE is a family of authenticated encryptions schemes submitted to the ongoing CAESAR competition and in addition presented at CHES 2014. To justify the use of ICEPOLE, or to point out potential weaknesses, third-party cryptanalysis is needed. In this work, we evaluate the resistance of ICEPOLE-128 against forgery attacks. By using differential cryptanalysis, we are able to create forgeries ...
متن کاملSAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition
We investigate six authenticated encryption schemes (ACORN, ASCON-128a, Ketje Jr, ICEPOLE-128a, MORUS, and NORX-32) from the CAESAR competition. We aim at state recovery attacks using a SAT solver as a main tool. Our analysis reveals that these schemes, as submitted to CAESAR, provide strong resistance against SAT-based state recoveries. To shed a light on their security margins, we also analys...
متن کاملA practical state recovery attack on the stream cipher Sablier v1
Sablier is an authenticated encryption cipher submitted to the CAESAR competition, which is composed of the encryption Sablier v1 and the authentication Au. In this work we present a state recovery attack against the encryption Sablier v1 with time complexity about 2 operations and data complexity about 24 of 16-bit keywords. Our attack is practical in the workstation. It is noticed that the up...
متن کاملA practical forgery and state recovery attack on the authenticated cipher PANDA-s
PANDA is a family of authenticated ciphers submitted to CARSAR, which consists of two ciphers: PANDA-s and PANDA-b. In this work we present a state recovery attack against PANDA-s with time complexity about 2 under the known-plaintext-attack model, which needs 137 pairs of known plaintext/ciphertext and about 2GB memories. Our attack is practical in a small workstation. Based on the above attac...
متن کامل